Transactions in relaxed memory architectures
نویسندگان
چکیده
منابع مشابه
Hardware support for Local Memory Transactions on GPU Architectures
Graphics Processing Units (GPUs) are popular hardware accelerators for data-parallel applications, enabling the execution of thousands of threads in a Single Instruction Multiple Thread (SIMT) fashion. However, the SIMT execution model is not efficient when code includes critical sections to protect the access to data shared by the running threads. In addition, GPUs offer two shared spaces to t...
متن کاملSoftware Transactional Memory on Relaxed Memory Models
Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed memory models, with the atomicity of operations as provided by the hardware. This paper presents the first approach to verify STMs under relaxed...
متن کاملModeling Relaxed Memory Consistency Protocols
This paper presents a modeling approach based on deterministic and stochastic Petri nets (DSPN's) for analyzing memory consistency protocols for multiprocessors with Distributed Shared Memory (DSM). DSPN's are a numerically solvable modeling formalism with a graphical representation. The modeling approach addresses in particular the performance degradation due to the amount of message exchange,...
متن کاملHardware Transactions in Nonvolatile Memory
Hardware transactional memory (HTM) implementations already provide a transactional abstraction at HW speed in multi-core systems. The imminent availability of mature byte-addressable, nonvolatile memory (NVM) will provide persistence at the speed of accessing main memory. This paper presents the notion of persistent HTM (PHTM), which combines HTM and NVM and features hardware-assisted, lockfre...
متن کاملPersistent Memory Transactions
This paper presents a comprehensive analysis of performance trade offs between implementation choices for transaction runtime systems on persistent memory. We compare three implementations of transaction runtimes: undo logging, redo logging, and copy-on-write. We also present a memory allocator that plugs into these runtimes. Our microbenchmark based evaluation focuses on understanding the inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2018
ISSN: 2475-1421
DOI: 10.1145/3158106